Co-induction Characterization of Branching Bisimulation with Explicit Divergence∗
نویسندگان
چکیده
Branching bisimulation with explicit divergence, introduced by van Glabbeek and Weijland, is an important relation between processes. It is the weakest equivalence relation which is a branching bisimulation and at the same time divergence preserving. Like branching bisimulation, it has two major characterizations in the literature: a relational characterization and a coloured trace characterization. Unlike branching bisimulation, the two characterizations are not directly based on the powerful tool of co-induction. In this paper we propose a coloured trace characterization and a relational characterization, both based on co-induction. The new characterizations can benefit not only theoretical development, but also verification practice. 1998 ACM Subject Classification F.1.2
منابع مشابه
Branching Bisimulation with Explicit Divergence
We consider the relational characterisation of branching bisimulation with explicit divergence. We prove that it is an equivalence relation and that it coincides with the original definition of branching bisimulation with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with untiland divergence modalities.
متن کاملBranching bisimulation equivalence with explicit divergence
We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with untiland divergence modalities.
متن کاملBranching Bisimilarity with Explicit Divergence
We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with untiland divergence modalities.
متن کاملComputation Tree Logic with Deadlock Detection
We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL−X). This relation is obtained by De Nicola & Vaandrager by translating labelled transition systems to Kripke structures, while lifting the totality restriction on the latter. They characterised it as divergence sensitive branch...
متن کاملNext-preserving branching bisimulation
Bisimulations are in general equivalence relations between transition systems which assure that certain aspects of the behaviour of the systems are the same. For many applications it is not possible to maintain such an equivalence unless non-observable (stuttering) behaviour is ignored. However, existing bisimulation relations which permit the removal of non-observable behaviour are unable to p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015